0.13/0.18 % Problem : Vampire---4.8_12445 : TPTP v0.0.0. Released v0.0.0. 0.13/0.19 % Command : run_E %s %d THM 0.20/0.41 % Computer : n017.cluster.edu 0.20/0.41 % Model : x86_64 x86_64 0.20/0.41 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.20/0.41 % Memory : 8042.1875MB 0.20/0.41 % OS : Linux 3.10.0-693.el7.x86_64 0.20/0.41 % CPULimit : 1440 0.20/0.41 % WCLimit : 180 0.20/0.41 % DateTime : Mon Jul 3 12:19:23 EDT 2023 0.20/0.41 % CPUTime : 0.49/0.66 Running higher-order theorem provingRunning: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=180 /export/starexec/sandbox/tmp/tmp.5FUZdEPikg/Vampire---4.8_12445 0.49/0.66 # Version: 3.1pre001-ho 0.53/0.78 # Preprocessing class: HSLMSMSMLLLCHSA. 0.53/0.78 # Scheduled 5 strats onto 8 cores with 180 seconds (1440 total) 0.53/0.78 # Starting pre_casc_4 with 720s (4) cores 0.53/0.78 # Starting full_lambda_6 with 180s (1) cores 0.53/0.78 # Starting sh10 with 180s (1) cores 0.53/0.78 # Starting post_as_ho9 with 180s (1) cores 0.53/0.78 # Starting post_as_ho8 with 180s (1) cores 0.53/0.78 # pre_casc_4 with pid 12806 completed with status 0 0.53/0.78 # Result found by pre_casc_4 0.53/0.78 # Preprocessing class: HSLMSMSMLLLCHSA. 0.53/0.78 # Scheduled 5 strats onto 8 cores with 180 seconds (1440 total) 0.53/0.78 # Starting pre_casc_4 with 720s (4) cores 0.53/0.78 # SinE strategy is GSinE(CountFormulas,,true,1.5,0,3,20000,1.0,true) 0.53/0.78 # Search class: HGUSM-FSLM31-DHSMMFBN 0.53/0.78 # partial match(2): HGUSM-FSLM31-DHSFFFBN 0.53/0.78 # Scheduled 6 strats onto 4 cores with 720 seconds (720 total) 0.53/0.78 # Starting new_bool_5 with 324s (1) cores 0.53/0.78 # Starting pre_casc_4 with 73s (1) cores 0.53/0.78 # Starting ehoh_best8_lambda with 81s (1) cores 0.53/0.78 # Starting new_bool_1 with 81s (1) cores 0.53/0.78 # pre_casc_4 with pid 12814 completed with status 0 0.53/0.78 # Result found by pre_casc_4 0.53/0.78 # Preprocessing class: HSLMSMSMLLLCHSA. 0.53/0.78 # Scheduled 5 strats onto 8 cores with 180 seconds (1440 total) 0.53/0.78 # Starting pre_casc_4 with 720s (4) cores 0.53/0.78 # SinE strategy is GSinE(CountFormulas,,true,1.5,0,3,20000,1.0,true) 0.53/0.78 # Search class: HGUSM-FSLM31-DHSMMFBN 0.53/0.78 # partial match(2): HGUSM-FSLM31-DHSFFFBN 0.53/0.78 # Scheduled 6 strats onto 4 cores with 720 seconds (720 total) 0.53/0.78 # Starting new_bool_5 with 324s (1) cores 0.53/0.78 # Starting pre_casc_4 with 73s (1) cores 0.53/0.78 # Preprocessing time : 0.005 s 0.53/0.78 # Presaturation interreduction done 0.53/0.78 0.53/0.78 # Proof found! 0.53/0.78 # SZS status Theorem 0.53/0.78 # SZS output start CNFRefutation 0.53/0.78 thf(decl_22, type, is_of: $i > ($i > $o) > $o). 0.53/0.78 thf(decl_23, type, all_of: ($i > $o) > ($i > $o) > $o). 0.53/0.78 thf(decl_25, type, in: $i > $i > $o). 0.53/0.78 thf(decl_72, type, l_some: $i > ($i > $o) > $o). 0.53/0.78 thf(decl_77, type, e_is: $i > $i > $i > $o). 0.53/0.78 thf(decl_123, type, nat: $i). 0.53/0.78 thf(decl_124, type, n_is: $i > $i > $o). 0.53/0.78 thf(decl_127, type, n_some: ($i > $o) > $o). 0.53/0.78 thf(decl_142, type, n_pl: $i > $i > $i). 0.53/0.78 thf(decl_147, type, diffprop: $i > $i > $i > $o). 0.53/0.78 thf(decl_148, type, d_29_ii: $i > $i > $o). 0.53/0.78 thf(decl_149, type, iii: $i > $i > $o). 0.53/0.78 thf(decl_162, type, n_ts: $i > $i > $i). 0.53/0.78 thf(decl_189, type, frac: $i). 0.53/0.78 thf(decl_191, type, num: $i > $i). 0.53/0.78 thf(decl_192, type, den: $i > $i). 0.53/0.78 thf(decl_194, type, moref: $i > $i > $o). 0.53/0.78 thf(decl_195, type, lessf: $i > $i > $o). 0.53/0.78 thf(decl_198, type, n_pf: $i > $i > $i). 0.53/0.78 thf(decl_200, type, esk1_0: $i). 0.53/0.78 thf(decl_201, type, esk2_0: $i). 0.53/0.78 thf(decl_202, type, esk3_0: $i). 0.53/0.78 thf(def_diffprop, axiom, ((diffprop)=(^[X1:$i, X183:$i, X4:$i]:((n_is @ X1 @ (n_pl @ X183 @ X4))))), file('/export/starexec/sandbox/tmp/tmp.5FUZdEPikg/Vampire---4.8_12445', def_diffprop)). 0.53/0.78 thf(def_d_29_ii, axiom, ((d_29_ii)=(^[X1:$i, X184:$i]:((n_some @ (diffprop @ X1 @ X184))))), file('/export/starexec/sandbox/tmp/tmp.5FUZdEPikg/Vampire---4.8_12445', def_d_29_ii)). 0.53/0.78 thf(def_n_is, axiom, ((n_is)=(e_is @ nat)), file('/export/starexec/sandbox/tmp/tmp.5FUZdEPikg/Vampire---4.8_12445', def_n_is)). 0.53/0.78 thf(def_iii, axiom, ((iii)=(^[X1:$i, X185:$i]:((n_some @ (diffprop @ X185 @ X1))))), file('/export/starexec/sandbox/tmp/tmp.5FUZdEPikg/Vampire---4.8_12445', def_iii)). 0.53/0.78 thf(def_all_of, axiom, ((all_of)=(^[X3:$i > $o, X2:$i > $o]:(![X4:$i]:(((is_of @ X4 @ X3)=>(X2 @ X4)))))), file('/export/starexec/sandbox/tmp/tmp.5FUZdEPikg/Vampire---4.8_12445', def_all_of)). 0.53/0.78 thf(def_is_of, axiom, ((is_of)=(^[X1:$i, X2:$i > $o]:((X2 @ X1)))), file('/export/starexec/sandbox/tmp/tmp.5FUZdEPikg/Vampire---4.8_12445', def_is_of)). 0.53/0.78 thf(def_moref, axiom, ((moref)=(^[X1:$i, X219:$i]:((d_29_ii @ (n_ts @ (num @ X1) @ (den @ X219)) @ (n_ts @ (num @ X219) @ (den @ X1)))))), file('/export/starexec/sandbox/tmp/tmp.5FUZdEPikg/Vampire---4.8_12445', def_moref)). 0.53/0.78 thf(def_n_some, axiom, ((n_some)=(l_some @ nat)), file('/export/starexec/sandbox/tmp/tmp.5FUZdEPikg/Vampire---4.8_12445', def_n_some)). 0.53/0.78 thf(def_lessf, axiom, ((lessf)=(^[X1:$i, X220:$i]:((iii @ (n_ts @ (num @ X1) @ (den @ X220)) @ (n_ts @ (num @ X220) @ (den @ X1)))))), file('/export/starexec/sandbox/tmp/tmp.5FUZdEPikg/Vampire---4.8_12445', def_lessf)). 0.53/0.78 thf(satz63a, axiom, (all_of @ (^[X1:$i]:((in @ X1 @ frac))) @ (^[X1:$i]:((all_of @ (^[X244:$i]:((in @ X244 @ frac))) @ (^[X245:$i]:((all_of @ (^[X4:$i]:((in @ X4 @ frac))) @ (^[X4:$i]:(((moref @ (n_pf @ X1 @ X4) @ (n_pf @ X245 @ X4))=>(moref @ X1 @ X245))))))))))), file('/export/starexec/sandbox/tmp/tmp.5FUZdEPikg/Vampire---4.8_12445', satz63a)). 0.53/0.78 thf(satz63c, conjecture, (all_of @ (^[X1:$i]:((in @ X1 @ frac))) @ (^[X1:$i]:((all_of @ (^[X311:$i]:((in @ X311 @ frac))) @ (^[X312:$i]:((all_of @ (^[X4:$i]:((in @ X4 @ frac))) @ (^[X4:$i]:(((lessf @ (n_pf @ X1 @ X4) @ (n_pf @ X312 @ X4))=>(lessf @ X1 @ X312))))))))))), file('/export/starexec/sandbox/tmp/tmp.5FUZdEPikg/Vampire---4.8_12445', satz63c)). 0.53/0.78 thf(c_0_11, plain, ((diffprop)=(^[Z0/* 19 */:$i, Z1:$i, Z2:$i]:((e_is @ nat @ Z0 @ (n_pl @ Z1 @ Z2))))), inference(fof_simplification,[status(thm)],[def_diffprop])). 0.53/0.78 thf(c_0_12, plain, ((d_29_ii)=(^[Z0/* 19 */:$i, Z1:$i]:((l_some @ nat @ (^[Z2/* 3 */:$i]:((e_is @ nat @ Z0 @ (n_pl @ Z1 @ Z2)))))))), inference(fof_simplification,[status(thm)],[def_d_29_ii])). 0.53/0.78 thf(c_0_13, plain, ((diffprop)=(^[Z0/* 19 */:$i, Z1:$i, Z2:$i]:((e_is @ nat @ Z0 @ (n_pl @ Z1 @ Z2))))), inference(apply_def,[status(thm)],[c_0_11, def_n_is])). 0.53/0.78 thf(c_0_14, plain, ((iii)=(^[Z0/* 19 */:$i, Z1:$i]:((l_some @ nat @ (^[Z2/* 3 */:$i]:((e_is @ nat @ Z1 @ (n_pl @ Z0 @ Z2)))))))), inference(fof_simplification,[status(thm)],[def_iii])). 0.53/0.78 thf(c_0_15, plain, ((all_of)=(^[Z0/* 19 */:$i > $o, Z1:$i > $o]:(![X4:$i]:((((Z0 @ X4))=>(Z1 @ X4)))))), inference(fof_simplification,[status(thm)],[def_all_of])). 0.53/0.78 thf(c_0_16, plain, ((is_of)=(^[Z0/* 19 */:$i, Z1:$i > $o]:((Z1 @ Z0)))), inference(fof_simplification,[status(thm)],[def_is_of])). 0.53/0.78 thf(c_0_17, plain, ((moref)=(^[Z0/* 19 */:$i, Z1:$i]:(((l_some @ nat @ (^[Z2/* 3 */:$i]:((e_is @ nat @ (n_ts @ (num @ Z0) @ (den @ Z1)) @ (n_pl @ (n_ts @ (num @ Z1) @ (den @ Z0)) @ Z2))))))))), inference(fof_simplification,[status(thm)],[def_moref])). 0.53/0.78 thf(c_0_18, plain, ((d_29_ii)=(^[Z0/* 19 */:$i, Z1:$i]:((l_some @ nat @ (^[Z2/* 3 */:$i]:((e_is @ nat @ Z0 @ (n_pl @ Z1 @ Z2)))))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_12, c_0_13]), def_n_some])). 0.53/0.78 thf(c_0_19, plain, ((lessf)=(^[Z0/* 19 */:$i, Z1:$i]:(((l_some @ nat @ (^[Z2/* 3 */:$i]:((e_is @ nat @ (n_ts @ (num @ Z1) @ (den @ Z0)) @ (n_pl @ (n_ts @ (num @ Z0) @ (den @ Z1)) @ Z2))))))))), inference(fof_simplification,[status(thm)],[def_lessf])). 0.53/0.78 thf(c_0_20, plain, ((iii)=(^[Z0/* 19 */:$i, Z1:$i]:((l_some @ nat @ (^[Z2/* 3 */:$i]:((e_is @ nat @ Z1 @ (n_pl @ Z0 @ Z2)))))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_14, c_0_13]), def_n_some])). 0.53/0.78 thf(c_0_21, plain, ((all_of)=(^[Z0/* 19 */:$i > $o, Z1:$i > $o]:(![X4:$i]:((((Z0 @ X4))=>(Z1 @ X4)))))), inference(apply_def,[status(thm)],[c_0_15, c_0_16])). 0.53/0.78 thf(c_0_22, plain, ((moref)=(^[Z0/* 19 */:$i, Z1:$i]:(((l_some @ nat @ (^[Z2/* 3 */:$i]:((e_is @ nat @ (n_ts @ (num @ Z0) @ (den @ Z1)) @ (n_pl @ (n_ts @ (num @ Z1) @ (den @ Z0)) @ Z2))))))))), inference(apply_def,[status(thm)],[c_0_17, c_0_18])). 0.53/0.78 thf(c_0_23, plain, ((lessf)=(^[Z0/* 19 */:$i, Z1:$i]:(((l_some @ nat @ (^[Z2/* 3 */:$i]:((e_is @ nat @ (n_ts @ (num @ Z1) @ (den @ Z0)) @ (n_pl @ (n_ts @ (num @ Z0) @ (den @ Z1)) @ Z2))))))))), inference(apply_def,[status(thm)],[c_0_19, c_0_20])). 0.53/0.78 thf(c_0_24, plain, ![X602:$i]:(((in @ X602 @ frac)=>![X601:$i]:(((in @ X601 @ frac)=>![X600:$i]:(((in @ X600 @ frac)=>((l_some @ nat @ (^[Z0/* 3 */:$i]:((e_is @ nat @ (n_ts @ (num @ (n_pf @ X602 @ X600)) @ (den @ (n_pf @ X601 @ X600))) @ (n_pl @ (n_ts @ (num @ (n_pf @ X601 @ X600)) @ (den @ (n_pf @ X602 @ X600))) @ Z0)))))=>(l_some @ nat @ (^[Z0/* 3 */:$i]:((e_is @ nat @ (n_ts @ (num @ X602) @ (den @ X601)) @ (n_pl @ (n_ts @ (num @ X601) @ (den @ X602)) @ Z0)))))))))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[satz63a]), c_0_21]), c_0_22])). 0.53/0.78 thf(c_0_25, negated_conjecture, ~(![X587:$i]:(((in @ X587 @ frac)=>![X586:$i]:(((in @ X586 @ frac)=>![X585:$i]:(((in @ X585 @ frac)=>((l_some @ nat @ (^[Z0/* 3 */:$i]:((e_is @ nat @ (n_ts @ (num @ (n_pf @ X586 @ X585)) @ (den @ (n_pf @ X587 @ X585))) @ (n_pl @ (n_ts @ (num @ (n_pf @ X587 @ X585)) @ (den @ (n_pf @ X586 @ X585))) @ Z0)))))=>(l_some @ nat @ (^[Z0/* 3 */:$i]:((e_is @ nat @ (n_ts @ (num @ X586) @ (den @ X587)) @ (n_pl @ (n_ts @ (num @ X587) @ (den @ X586)) @ Z0))))))))))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[satz63c])]), c_0_21]), c_0_23])). 0.53/0.78 thf(c_0_26, plain, ![X892:$i, X893:$i, X894:$i]:((~(in @ X892 @ frac)|(~(in @ X893 @ frac)|(~(in @ X894 @ frac)|(~(l_some @ nat @ (^[Z0/* 3 */:$i]:((e_is @ nat @ (n_ts @ (num @ (n_pf @ X892 @ X894)) @ (den @ (n_pf @ X893 @ X894))) @ (n_pl @ (n_ts @ (num @ (n_pf @ X893 @ X894)) @ (den @ (n_pf @ X892 @ X894))) @ Z0)))))|(l_some @ nat @ (^[Z0/* 3 */:$i]:((e_is @ nat @ (n_ts @ (num @ X892) @ (den @ X893)) @ (n_pl @ (n_ts @ (num @ X893) @ (den @ X892)) @ Z0)))))))))), inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_24])])])). 0.53/0.78 thf(c_0_27, negated_conjecture, ((in @ esk1_0 @ frac)&((in @ esk2_0 @ frac)&((in @ esk3_0 @ frac)&((l_some @ nat @ (^[Z0/* 3 */:$i]:((e_is @ nat @ (n_ts @ (num @ (n_pf @ esk2_0 @ esk3_0)) @ (den @ (n_pf @ esk1_0 @ esk3_0))) @ (n_pl @ (n_ts @ (num @ (n_pf @ esk1_0 @ esk3_0)) @ (den @ (n_pf @ esk2_0 @ esk3_0))) @ Z0)))))&~(l_some @ nat @ (^[Z0/* 3 */:$i]:((e_is @ nat @ (n_ts @ (num @ esk2_0) @ (den @ esk1_0)) @ (n_pl @ (n_ts @ (num @ esk1_0) @ (den @ esk2_0)) @ Z0))))))))), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_25])])])). 0.53/0.78 thf(c_0_28, plain, ![X1:$i, X4:$i, X5:$i]:(((l_some @ nat @ (^[Z0/* 3 */:$i]:((e_is @ nat @ (n_ts @ (num @ X1) @ (den @ X4)) @ (n_pl @ (n_ts @ (num @ X4) @ (den @ X1)) @ Z0)))))|~((in @ X1 @ frac))|~((in @ X4 @ frac))|~((in @ X5 @ frac))|~((l_some @ nat @ (^[Z0/* 3 */:$i]:((e_is @ nat @ (n_ts @ (num @ (n_pf @ X1 @ X5)) @ (den @ (n_pf @ X4 @ X5))) @ (n_pl @ (n_ts @ (num @ (n_pf @ X4 @ X5)) @ (den @ (n_pf @ X1 @ X5))) @ Z0)))))))), inference(split_conjunct,[status(thm)],[c_0_26])). 0.53/0.78 thf(c_0_29, negated_conjecture, (l_some @ nat @ (^[Z0/* 3 */:$i]:((e_is @ nat @ (n_ts @ (num @ (n_pf @ esk2_0 @ esk3_0)) @ (den @ (n_pf @ esk1_0 @ esk3_0))) @ (n_pl @ (n_ts @ (num @ (n_pf @ esk1_0 @ esk3_0)) @ (den @ (n_pf @ esk2_0 @ esk3_0))) @ Z0))))), inference(split_conjunct,[status(thm)],[c_0_27])). 0.53/0.78 thf(c_0_30, negated_conjecture, (in @ esk3_0 @ frac), inference(split_conjunct,[status(thm)],[c_0_27])). 0.53/0.78 thf(c_0_31, negated_conjecture, (in @ esk1_0 @ frac), inference(split_conjunct,[status(thm)],[c_0_27])). 0.53/0.78 thf(c_0_32, negated_conjecture, (in @ esk2_0 @ frac), inference(split_conjunct,[status(thm)],[c_0_27])). 0.53/0.78 thf(c_0_33, negated_conjecture, ~((l_some @ nat @ (^[Z0/* 3 */:$i]:((e_is @ nat @ (n_ts @ (num @ esk2_0) @ (den @ esk1_0)) @ (n_pl @ (n_ts @ (num @ esk1_0) @ (den @ esk2_0)) @ Z0)))))), inference(split_conjunct,[status(thm)],[c_0_27])). 0.53/0.78 thf(c_0_34, negated_conjecture, ($false), inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28, c_0_29]), c_0_30]), c_0_31]), c_0_32])]), c_0_33]), ['proof']). 0.53/0.78 # SZS output end CNFRefutation 0.53/0.78 # Parsed axioms : 594 0.53/0.78 # Removed by relevancy pruning/SinE : 445 0.53/0.78 # Initial clauses : 157 0.53/0.78 # Removed in clause preprocessing : 4 0.53/0.78 # Initial clauses in saturation : 153 0.53/0.78 # Processed clauses : 361 0.53/0.78 # ...of these trivial : 2 0.53/0.78 # ...subsumed : 38 0.53/0.78 # ...remaining for further processing : 321 0.53/0.78 # Other redundant clauses eliminated : 14 0.53/0.78 # Clauses deleted for lack of memory : 0 0.53/0.78 # Backward-subsumed : 0 0.53/0.78 # Backward-rewritten : 6 0.53/0.78 # Generated clauses : 1567 0.53/0.78 # ...of the previous two non-redundant : 1498 0.53/0.78 # ...aggressively subsumed : 0 0.53/0.78 # Contextual simplify-reflections : 0 0.53/0.78 # Paramodulations : 435 0.53/0.78 # Factorizations : 0 0.53/0.78 # NegExts : 5 0.53/0.78 # Equation resolutions : 15 0.53/0.78 # Total rewrite steps : 231 0.53/0.78 # Propositional unsat checks : 0 0.53/0.78 # Propositional check models : 0 0.53/0.78 # Propositional check unsatisfiable : 0 0.53/0.78 # Propositional clauses : 0 0.53/0.78 # Propositional clauses after purity: 0 0.53/0.78 # Propositional unsat core size : 0 0.53/0.78 # Propositional preprocessing time : 0.000 0.53/0.78 # Propositional encoding time : 0.000 0.53/0.78 # Propositional solver time : 0.000 0.53/0.78 # Success case prop preproc time : 0.000 0.53/0.78 # Success case prop encoding time : 0.000 0.53/0.78 # Success case prop solver time : 0.000 0.53/0.78 # Current number of processed clauses : 175 0.53/0.78 # Positive orientable unit clauses : 50 0.53/0.78 # Positive unorientable unit clauses: 0 0.53/0.78 # Negative unit clauses : 7 0.53/0.78 # Non-unit-clauses : 118 0.53/0.78 # Current number of unprocessed clauses: 1362 0.53/0.78 # ...number of literals in the above : 11771 0.53/0.78 # Current number of archived formulas : 0 0.53/0.78 # Current number of archived clauses : 146 0.53/0.78 # Clause-clause subsumption calls (NU) : 14436 0.53/0.78 # Rec. Clause-clause subsumption calls : 2819 0.53/0.78 # Non-unit clause-clause subsumptions : 31 0.53/0.78 # Unit Clause-clause subsumption calls : 36 0.53/0.78 # Rewrite failures with RHS unbound : 0 0.53/0.78 # BW rewrite match attempts : 23 0.53/0.78 # BW rewrite match successes : 6 0.53/0.78 # Condensation attempts : 0 0.53/0.78 # Condensation successes : 0 0.53/0.78 # Termbank termtop insertions : 99280 0.53/0.78 0.53/0.78 # ------------------------------------------------- 0.53/0.78 # User time : 0.086 s 0.53/0.78 # System time : 0.013 s 0.53/0.78 # Total time : 0.099 s 0.53/0.78 # Maximum resident set size: 5824 pages 0.53/0.79 0.53/0.79 # ------------------------------------------------- 0.53/0.79 # User time : 0.289 s 0.53/0.79 # System time : 0.034 s 0.53/0.79 # Total time : 0.322 s 0.53/0.79 # Maximum resident set size: 2852 pages 0.53/0.79 % E---3.1 exiting 0.53/0.79 EOF